Consistency Cuts for Dantzig-Wolfe Reformulations

A New Family of Valid-Inequalities for Dantzig-Wolfe Reformulation Mixed Integer Linear Programs In “Consistency Cuts Reformulation,” Jens Vinther Clausen, Richard Lusby, and Stefan Ropke present a new family valid inequalities to be applied reformulations with binary linking variables. They show that, mixed integer linear programs that satisfy certain properties, it is enough solve the programming relaxation reformulation all consistency cuts obtain solutions. An example this temporal knapsack problem; effectiveness tested on set 200 instances problem, results are state-of-the-art solution times. For problems do not these conditions, can still used in branch-and-cut-and-price framework. order this, generic from online library MIPLIB. These tests applicability general.